Using MACSYMA to write FORTRAN subroutines

Fortran Subroutines Produced from Computer Algebra Systems: Using Gentrans from Reduce and from Macsyma

Fortran Subroutines for B - nets of Box

We describe an algorithm to compute the B-nets of bivariate box splines on a three{ or four{directional mesh. Two pseudo Fortran programs for those B-nets are given.

LMBM — FORTRAN Subroutines for Large-Scale Nonsmooth Minimization: User’s Manual

LMBM is a limited memory bundle method for large-scale nonsmooth, possibly nonconvex, optimization. It is intended for problems that are difficult or even impossible to solve with classical gradient-based optimization methods due to nonsmoothness and for problems that can not be solved efficiently with standard nonsmooth optimization methods (like proximal bundle and bundle trust methods) due t...

Algorithm PREQN Fortran Subroutines for Preconditioning the Conjugate Gradient Method

PREQN is a package of Fortran subroutines for automatically generating pre conditioners for the conjugate gradient method It is designed for solving a sequence of linear systems Aix bi i t where the coe cient matrices Ai are symmetric and positive de nite and vary slowly Problems of this type arise for example in non linear optimization The preconditioners are based on limited memory quasi Newt...

Fortran Subroutines for Computing Approximate Solutions of Feedback Set Problems Using Grasp

We describe FORTRAN subroutines for approximately solving the feedback vertex and arc set problems on directed graphs using a Greedy Randomized Adaptive Search Procedure (GRASP). The algorithms are described in detail. Implementation and usage of the package is outlined and computational experiments are reported illustrating solution quality as a function of running time. The source code can be...